Amplification of slight probabilistic advantage at absolutely no cost in space
نویسندگان
چکیده
Nondeterministic Turing acceptors can be viewed as probabilistic accep-tors with errors that are one-sided but not signiicantly bounded. In his seminal work on resource-bounded probabilistic Turing machines Gi77], Gill showed how to transform such a machine to one that does have a good error bound, at only modest cost in space usage. We describe a simpler transformation that incurs absolutely no cost in space usage. If we change each probabilistic transition to a nondeterministic one, then we get a space-preserving transformation in the opposite direction as well, assuming the dee-nitions are right. Thus the complexity classes are exactly the same, and we have the same space-bound hierarchy for bounded-one-sided-error probabilistic computation that we have for nondeterministic computation. Similarly, we have the same number-of-heads complexity classes and hierarchy for bounded-one-sided-error probabilistic multihead nite automata as for nondeterministic ones.
منابع مشابه
Completeness in Probabilistic Metric Spaces
The idea of probabilistic metric space was introduced by Menger and he showed that probabilistic metric spaces are generalizations of metric spaces. Thus, in this paper, we prove some of the important features and theorems and conclusions that are found in metric spaces. At the beginning of this paper, the distance distribution functions are proposed. These functions are essential in defining p...
متن کاملEfficiency of a multi-objective imperialist competitive algorithm: A bi-objective location-routing-inventory problem with probabilistic routes
An integrated model considers all parameters and elements of different deficiencies in one problem. This paper presents a new integrated model of a supply chain that simultaneously considers facility location, vehicle routing and inventory control problems as well as their interactions in one problem, called location-routing-inventory (LRI) problem. This model also considers stochastic demands ...
متن کاملMenger probabilistic normed space is a category topological vector space
In this paper, we formalize the Menger probabilistic normed space as a category in which its objects are the Menger probabilistic normed spaces and its morphisms are fuzzy continuous operators. Then, we show that the category of probabilistic normed spaces is isomorphicly a subcategory of the category of topological vector spaces. So, we can easily apply the results of topological vector spaces...
متن کاملRelationships Between Quantum and Classical Space-Bounded Complexity Classes
This paper investigates the relative power of space-bounded quantum and classical (probabilistic) computational models. The following relationships are proved. 1. Any probabilistic Turing machine (PTM) which runs in space s and which halts absolutely (i.e. halts with certainty after a nite number of steps) can be simulated in space O(s) by a quantum Turing machine (QTM). If the PTM operates wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 72 شماره
صفحات -
تاریخ انتشار 1999